Search results for "Subdivision surface"

showing 8 items of 8 documents

Representation of NURBS surfaces by Controlled Iterated Functions System automata

2019

Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures.This work focuses…

Computer scienceBasis functionBézier curve02 engineering and technology[INFO] Computer Science [cs]Computer Science::Computational Geometry01 natural scienceslcsh:QA75.5-76.95Iterated function system0202 electrical engineering electronic engineering information engineeringSubdivision surface[INFO]Computer Science [cs]0101 mathematicsComputingMilieux_MISCELLANEOUSSubdivisionFinite-state machinebusiness.industry010102 general mathematicsGeneral Engineering020207 software engineeringComputer Graphics and Computer-Aided Design[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]AutomatonHuman-Computer InteractionAlgebraComputer Science::GraphicsIterated functionlcsh:Electronic computers. Computer sciencebusinessComputers & Graphics: X
researchProduct

A Graph Based Algorithm For Intersection Of Subdivision Surfaces

2003

Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the fol…

Discrete mathematicsFoster graph[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Intersection number (graph theory)Intersection graphlaw.inventionCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]IntersectionlawHomeomorphism (graph theory)Subdivision surfaceCircle graphAlgorithmComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMethodologies_COMPUTERGRAPHICSMathematicsDistance-hereditary graph
researchProduct

Generalized SCODEF Deformations on Subdivision Surfaces

2006

This paper proposes to define a generalized SCODEF deformation method on a subdivision surface. It combines an “easy-to-use” free-form deformation with a Loop subdivision algorithm. The deformation method processes only on vertices of an object and permits the satisfaction of geometrical constraints given by the user. The method controls the resulting shape, defining the range (i.e. the impact) of the deformation on an object before applying it. The deformation takes into account the Loop properties to follow the subdivision scheme, allowing the user to fix some constraints at the subdivision-level he works on and to render the final object at the level he wants to. We also propose an adapt…

Loop (graph theory)business.industryComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONGeometryDeformation (meteorology)Constraint satisfactionObject (computer science)Range (mathematics)Computer Science::GraphicsMotion estimationSubdivision surfacebusinessAlgorithmComputingMethodologies_COMPUTERGRAPHICSSubdivision
researchProduct

Curvilinear constraints for free form deformations on subdivision surfaces

2010

This paper presents a method to deform a subdivision surface with curvilinear constraints. It combines an intuitive free form deformation with a Loop subdivision algorithm. The main advantage of this method of deformation is that it uses only vertices of an object and satisfies the geometrical constraints provided by the user. It permits us to control the final shape of the deformed object, defining the range (i.e. the impact) of the deformation before applying it. The deformation takes into account the Loop properties to follow the subdivision scheme, allowing the user to fix some curvilinear constraints at the subdivision level he works on and to render the final object at the level he wa…

Surface (mathematics)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION020101 civil engineering02 engineering and technologyDeformation (meteorology)Topology[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]0201 civil engineeringModelling and Simulation0202 electrical engineering electronic engineering information engineeringSubdivision surfaceComputingMilieux_MISCELLANEOUSComputingMethodologies_COMPUTERGRAPHICSMathematicsSubdivisionCurvilinear coordinatesbusiness.industry020207 software engineering[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]Object (computer science)[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science ApplicationsRange (mathematics)Modeling and Simulation[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]Free-form deformationbusinessMathematical and Computer Modelling
researchProduct

Geometry control of the junction between two fractal curves

2012

International audience; The general objective of our work is to create a geometric modeller based on iterative processes. With this objective in mind, we have to provide tools that work with fractal objects in the same manner as with objects of classical topology. In this article we focus on the constructing of an intermediate curve between two other curves defined by different iterative construction processes. A similar problem often arises with subdivision surfaces, when the goal is to connect two surfaces with different subdivision masks. We start by dealing with curves, willing to later generalise our approach to surfaces. We formalise the problem with the Boundary Controlled Iterated F…

business.industry010102 general mathematics[INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR]Boundary (topology)Geometry[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]02 engineering and technology01 natural sciencesComputer Graphics and Computer-Aided DesignIndustrial and Manufacturing Engineering[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science ApplicationsConnection (mathematics)FractalIterated function system0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingSubdivision surface0101 mathematicsbusinessEigenvalues and eigenvectorsDifferential (mathematics)MathematicsSubdivisionComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Joining primal/dual subdivision surfaces

2012

International audience; In this article we study the problem of constructing an intermediate surface between two other surfaces defined by different iterative construction processes. This problem is formalised with Boundary Controlled Iterated Function System model. The formalism allows us to distinguish between subdivision of the topology and subdivision of the mesh. Although our method can be applied to surfaces with quadrangular topology subdivision, it can be used with any mesh subdivision (primal scheme, dual scheme or other.) Conditions that guarantee continuity of the intermediate surface determine the structure of subdivision matrices. Depending on the nature of the initial surfaces…

business.industry020207 software engineering010103 numerical & computational mathematics02 engineering and technology[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]Topology01 natural sciences[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Primal dualIterated function systemComputer Science::GraphicsAttractor0202 electrical engineering electronic engineering information engineeringSubdivision surfaceAlmost everywhereDifferentiable functionFinite subdivision rule0101 mathematicsbusinessMathematicsSubdivision
researchProduct

Reverse Catmull-Clark Subdivision

2006

Reverse subdivision consists in constructing a coarse mesh of a model from a finer mesh of this same model. In this paper, we give formulas for reverse Catmull-Clark subdivision. These formulas allow the constructing of a coarse mesh for almost all meshes. The condition for being able to apply these formulas is that the mesh to be reversed must be generated by the subdivision of a coarse mesh. Except for this condition, the mesh can be arbitrary. Vertices can be regular or extraordinary and the mesh itself can be arbitrary (triangular, quadrilateral…).

subdivision surfacesComputer Science::Graphicsmultiresolutionmultirozlišenídělené plochyanimationMathematicsofComputing_NUMERICALANALYSISanimaceCatmull-Clark schemeCatmull-Clarckovo schémaComputer Science::DatabasesComputingMethodologies_COMPUTERGRAPHICSMathematics::Numerical Analysis
researchProduct

Ositusmetodit reaaliaikaisessa renderöinnissä

2017

Tietokonegrafiikka ja siihen liittyvät menetelmät ovat nopeasti kehittyvä tutkimuksen ala. Tämän tutkimuksen tavoitteena on pohtia eri ositusmenetelmien toimintaa reaaliaikaisessa käytössä sekä vertailla näitä menetelmiä. Nykyaikaiselle käytölle tehokkaimmaksi osoittautui kolmesta tutkitusta menetelmästä tuorein (Brainerd ym. 2016). Tulevassa tutkimuksessa laitteistointegraatioon keskittyminen voisi tuoda ositusmenetelmät nopeammin kuluttajien saataville. Computergraphicsanditsmethodsarearapidlydevelopingfieldinresearch.The purpose of this study is to discuss and compare the functionality of several subdivision methods in real-time use. The latest of the three studied methods turned out to be…

subdivision surfacestietokonegrafiikkacomputer graphicsosa-aluepinnatrenderingrenderöinti
researchProduct